leetcode104-python 두 갈래 나무 최대 깊이

Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Note: A leaf is a node with no children. Example: Given bina...

leetcode - 간단leetcode